Nonmonotonic Reasoning with Well Founded Semantics
نویسندگان
چکیده
Well Founded Semantics is adequate to capture nonmonotonic reasoning if we interpret the Well Founded model of a program P as a (possibly incomplete) view of the world. Thus the Well Founded model may be accepted to be a definite view of the world and the extended stable models as alternative enlarged consistent belief models an agent may have about the world. Our purpose is to exhibit a modular systematic method of representing nonmonotonic problems with the Well Founded semantics of logic programs. In this paper we use this method to represent and solve some classical nonmonotonic problems. This leads us to consider our method quite generic.
منابع مشابه
A Nonmonotonic Disputation-Based Semantics and Proof Procedure for Logic Programs
Logic programs with nonmonotonic negation are embedded in a general, abstract disputation-based framework for nonmonotonic logics. This formalization induces a particular semantics, which is proved to extend well-founded semantics and whose expanded expressiveness is illustrated by different examples involving reasoning by cases. Moreover, we develop a formal proof procedure for skeptical reaso...
متن کاملOn a Nonmonotonic Disputation-based Semantics and Proof Procedure for Logic Programs
Logic programs with nonmonotonic negation are embedded in a general, abstract disputationbased framework for nonmonotonic logics. This formalization induces a particular semantics, which is proved to extend well-founded semantics and whose expanded expressiveness is illustrated by di erent examples involving reasoning by cases. Moreover, we develop a formal proof procedure for skeptical reasoni...
متن کاملNonmonotonic Reasoning for First - Order
The stable model semantics and the well-founded semantics are usually considered for programs with rules of the simple structure, which is a consequence of literals. We generalize these semantics for rst-order programs. We proof properties of these semantics, particular relations with minimal models and equivalent transformations. Besides, we investigate the possibilities of reducing rst-order ...
متن کاملNonmonotonic Description Logic Programs: Implementation and Experiments
The coupling of description logic reasoning systems with other reasoning formalisms (possibly over the Web) is becoming an important research issue and calls for advanced methods and algorithms. Recently, several notions of description logic programs have been introduced, combining rule-based semantics with description logics. Among them are nonmonotonic description logic programs (or dl-progra...
متن کاملIs Intractability of Non-Monotonic Reasoning a Real Drawback?
Several studies about computational complexity of nonmonotonic reasoning (NMR) showed that nonmonotonic inference is significantly harder than classical, monotonic inference. This contrasts with the general idea that NMR can be used to make knowledge representation and reasoning simpler, not harder. In this paper we show that, to some extent, NMR fulfills the representation goal. In particular,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991